Deterministic finite automaton - PDFSEARCH.IO - Document Search Engine

Deterministic finite automaton
Results: 142

#	Item
101	PDF Document Add to Reading List Source URL: media.wiley.com Language: English - Date: 2014-09-12 07:21:02 Powerset construction Finite-state machine Deterministic automaton Regular expression Regular language Nondeterministic finite automaton Deterministic finite automaton Automata theory Theoretical computer science Computer science
102	Regular-expression derivatives reexamined SCOTT OWENS University of Cambridge [removed] Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2010-01-10 16:47:22 Models of computation Computer science Software engineering Nondeterministic finite automaton Deterministic finite automaton Regular language Symbol String Regular expression Automata theory Formal languages Theoretical computer science
103	Duke University Department of Computer Science Department of Computer Science Box[removed]Duke University Add to Reading List Source URL: www.jflap.org Language: English - Date: 2011-05-17 21:20:11 Automata theory Formal languages Computer science Turing machine Finite-state machine Deterministic finite automaton Formal grammar Parsing Nondeterministic finite automaton Models of computation Theory of computation Theoretical computer science
104	Light-weight XPath Processing of XML Stream with Deterministic Automata Makoto Onizuka NTT CyberSpace Laboratories, NTT Corporation 1-1 Hikari-no-oka, Yokosuka, Kanagawa, [removed]Japan Add to Reading List Source URL: xmltk.sourceforge.net Language: English - Date: 2003-11-27 06:47:49 Models of computation Theoretical computer science Nondeterministic finite automaton Deterministic finite automaton DFA Records Regular expression Finite-state machine GOLD XML Automata theory Theory of computation Computing
105	1 Automata Theory Program file for this chapter: fsm Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2003-12-25 20:47:48 Theoretical computer science Computer science Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Abstract machine Formal language State diagram State Models of computation Theory of computation Automata theory
106	International Journal of Foundations of Computer Science c World Scientific Publishing Company The Design Principles and Algorithms of a Weighted Grammar Library Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:35 Computer science Applied mathematics Finite-state machine Finite state transducer Deterministic finite automaton Nondeterministic finite automaton N-gram Algorithm Speech recognition Automata theory Models of computation Theoretical computer science
107	A General Weighted Grammar Library Cyril Allauzen1 , Mehryar Mohri2 , and Brian Roark3? 1 AT&T Labs – Research 180 Park Avenue, Florham Park, NJ[removed] Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:31 Models of computation Computer science Finite state transducer Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Context-free grammar Powerset construction Regular expression Automata theory Formal languages Theoretical computer science
108	A General Weighted Grammar Library Cyril Allauzen, Mehryar Mohri, and Brian Roark AT&T Labs – Research, Shannon Laboratory 180 Park Avenue, Florham Park, NJ[removed] {allauzen, mohri, roark}@research.att.com http://w Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:30 Models of computation Computer science Software engineering Finite state transducer Finite-state machine Nondeterministic finite automaton Deterministic finite automaton Context-free grammar Powerset construction Automata theory Formal languages Theoretical computer science
109	COMS W3261: Computer Science Theory Class time: Tuesdays and Thursdays 2:40 - 3:55 PM Class location: MUDD 833 Instructor: Allison Lewko Office hours for Instructor: Tuesdays 10:00 AM - 12:00 PM in CSB 519 Add to Reading List Source URL: www.cs.columbia.edu Language: English - Date: 2014-02-27 18:24:23 Formal languages Applied mathematics Mathematics Theory of computation Computability Deterministic finite automaton Nondeterministic finite automaton Finite-state machine Complexity class Automata theory Models of computation Theoretical computer science
110	Symposium on Theoretical Aspects of Computer Science[removed]Bordeaux), pp[removed]www.stacs-conf.org EFFICIENT MINIMIZATION OF DFAS WITH PARTIAL TRANSITION FUNCTIONS ANTTI VALMARI Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2008-02-05 08:15:37 DFA minimization Nondeterministic finite automaton Symbol Mathematics Computing Logic Büchi automaton Automata theory Models of computation Deterministic finite automaton

UPDATE